Generalized circular colouring of graphs
نویسندگان
چکیده
Let P be a graph property and r, s ∈ N, r ≥ s. A strong circular (P , r, s)-colouring of a graph G is an assignment f : V (G) → {0, 1, . . . , r − 1}, such that the edges uv ∈ E(G) satisfying |f(u) − f(v)| < s or |f(u) − f(v)| > r − s, induce a subgraph of G with the propery P . In this paper we present some basic results on strong circular (P , r, s)-colourings. We introduce the strong circular P-chromatic number of a graph and we determine the strong circular P-chromatic number of complete graphs for additive and hereditary graph properties. 346 P. Mihók, J. Oravcová and R. Soták
منابع مشابه
Colouring game and generalized colouring game on graphs with cut-vertices
For k ≥ 2 we define a class of graphs Hk = {G : every block of G has at most k vertices}. The class Hk contains among other graphs forests, Husimi trees, line graphs of forests, cactus graphs. We consider the colouring game and the generalized colouring game on graphs from Hk.
متن کاملCircular consecutive choosability of graphs
Abstract This paper considers list circular colouring of graphs in which the colour list assigned to each vertex is an interval of a circle. The circular consecutive choosability chcc(G) of G is defined to be the least t such that for any circle S(r) of length r ≥ χc(G), if each vertex x of G is assigned an interval L(x) of S(r) of length t, then there is a circular r-colouring f of G such that...
متن کاملBalanced colourings of strongly regular graphs
A colouring of a strongly regular graph is an allocation of colours (or treatments) to the vertices of the graph. Such a colouring is balanced if every pair of distinct colours occurs equally often on the ends of an edge. When the graph is the complete regular multipartite graph a balanced colouring is just a balanced incomplete-block design, or 2-design. Some constructions are given. For examp...
متن کاملCircular game chromatic number of graphs
In a circular r-colouring game on G, Alice and Bob take turns colour the vertices of G with colours from the circle S(r) of perimeter r. Colours assigned to adjacent vertices need to have distance at least 1 in S(r). Alice wins the game if all vertices are coloured, and Bob wins the game if some uncoloured vertices have no legal colour. The circular game chromatic number χcg(G) of G is the infi...
متن کاملComplexity of Generalized Colourings of Chordal Graphs
The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P1, . . . ,Pk (usually describing some common graph properties), is to decide, for a given graph G, whether the vertex set of G can be partitioned into sets V1, . . . , Vk such that, for each i, the induced subgraph of G on Vi belongs to Pi. It can be seen that GCOL generalizes many natural colouri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 2011